Fourth Canadian Conference on Computational Geometry , St . John ' s , Newfoundland , August 1992 Placement and Compaction of Nonconvex Polygons for ClothingManufacture
نویسندگان
چکیده
منابع مشابه
K-Guarding Polygons on the Plane
Let P be a simple polygon with n vertices. We say that P is k-guardable if it is possible to find a set of points Q consisting of interior points of edges of P such that every point of P is visible from at least k elements in Q and no edge of P has more than one element in Q. The following question was asked by A. Lubiw at the open problem session of the Fourth Canadian Conference in Computatio...
متن کاملMultiple Containment Methods
We present three diierent methods for nding solutions to the 2D translation-only containment problem: nd translations for k polygons that place them inside a given polygonal container without overlap. Both the container and the polygons to be placed in it may be nonconvex. First, we provide several exact algorithms that improve results for k = 2 or k = 3. In particular, we give an algorithm for...
متن کاملIntersection of Nonconvex Polygons Using the Alternate Hierarchical Decomposition
Intersection computation is one of the fundamental operations of computational geometry. This paper presents an algorithm for intersection computation between two polygons (convex/nonconvex, with nonintersecting edges, and with or without holes). The approach is based on the decomposed representation of polygons, alternate hierarchical decomposition (AHD), that decomposes the nonconvex polygon ...
متن کاملFeasibility study of underground salt caverns in Western Newfoundland: experimental and finite element investigation of creep-induced damage
Underground caverns in rock salt deposits are the most secure disposal method and a type of gas-storing facility. Gas storage plays a vital role in ensuring that a strategic relationship is secured between an established energy infrastructure provider and a midstream energy company. The Fischells Brook area is a pillow-shaped body of salts located in the St. George's Bay area of southwest Newfo...
متن کاملProbing Polygons Minimally Is Hard
Belleville, P. and T.C. Shermer, Probing polygons minimally is hard, Computational Geometry: Theory and Applications 2 (1993) 255-265. Let r be a set of convex unimodal polygons in fixed position and orientation. We prove that the problem of determining whether k finger probes are sufficient to distinguish among the polygons in f is NP-complete for two types of finger probes. This implies that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992